An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
نویسندگان
چکیده
We present an approximation algorithm for the problem of finding a minimum-cost k-vertex connected spanning subgraph, assuming that the number of vertices is at least 6k. The approximation guarantee is six times the kth harmonic number (which is O(log k)), and this is also an upper bound on the integrality ratio for a standard linear programming relaxation.
منابع مشابه
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem
We present the rst truly polynomial-time approximation scheme (PTAS) for the minimum-cost k-vertex-(or, k-edge-) connected spanning subgraph problem for complete Euclidean graphs in R d : Previously it was known for every positive constant " how to construct in a polynomial time a graph on a superset of the input points which is k-vertex connected with respect to the input points, and whose cos...
متن کاملSurvivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملApproximation algorithms for minimum-cost k-(S, T ) connected digraphs
We introduce a model for NP-hard problems pertaining to the connectivity of graphs, and design approximation algorithms for some of the key problems in this model. One of the well-known NP-hard problems is to find a minimum-cost strongly connected spanning subgraph of a directed network. In the minimum-cost k-(S, T ) connected digraph (abbreviated, k-(S, T ) connectivity) problem we are given a...
متن کاملMin-Cost 2-Connected Subgraphs With k Terminals
In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S ⊆ V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, ...
متن کاملAn O(log k)-approximation algorithm for the k-vertex connected subgraph problem
We present an O(log n · log k)-approximation algorithm for the problem of finding k-vertex connected spanning subgraph of minimum cost, where n is the number of vertices in the input graph, and k is the connectivity requirement. Our algorithm works for both directed and undirected graphs. The best known approximation guarantees for this problems are O(ln k · min{ √ k, n n−k ln k}) by Kortsarz a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 32 شماره
صفحات -
تاریخ انتشار 2003